Extended Hopfield models for combinatorial optimization
نویسندگان
چکیده
منابع مشابه
Extended Hopfield models for combinatorial optimization
The extended Hopfield neural network proposed by Abe et al. for solving combinatorial optimization problems with equality and/or inequality constraints has the drawback of being frequently stabilized in states with neurons of ambiguous classification as active or inactive. We introduce in the model a competitive activation mechanism and we derive a new expression of the penalty energy allowing ...
متن کامل"Optimal" Hopfield network for combinatorial optimization with linear cost function
An "optimal" Hopfield network is presented for many of combinatorial optimization problems with linear cost function. It is proved that a vertex of the network state hypercube is asymptotically stable if and only if it is an optimal solution to the problem. That is, one can always obtain an optimal solution whenever the network converges to a vertex. In this sense, this network can be called th...
متن کاملMethods and Models for Combinatorial Optimization Heuristis for Combinatorial Optimization
In some cases, we may be able to find “efficient” exact algorithms to solve a COP: for example, the problem of finding the shortest paths on a graph, under some reasonable assumptions often met in practise, can be solved by the Dijkstra or Bellman-Ford algorithms, able to provide optimal solutions in running times according to a polynomial function (of small degree). For more complex problems, ...
متن کاملExtended formulations in combinatorial optimization
This survey is concerned with the size of perfect formulations for combinatorial optimization problems. By “perfect formulation”, we mean a system of linear inequalities that describes the convex hull of feasible solutions, viewed as vectors. Natural perfect formulations often have a number of inequalities that is exponential in the size of the data needed to describe the problem. Here we are p...
متن کاملImproving Combinatorial Optimization - Extended Abstract
Combinatorial Optimization is an important area of computer science that has many theoretical and practical applications. In the thesis [Chu, 2011], we present important contributions to several different areas of combinatorial optimization, including nogood learning, symmetry breaking, dominance, relaxations and parallelization. We develop a new nogood learning technique based on constraint pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Neural Networks
سال: 1999
ISSN: 1045-9227
DOI: 10.1109/72.737495